Fast Tetrahedron-Tetrahedron Overlap Algorithm
نویسندگان
چکیده
We present an algorithm to test two tetrahedra for overlap. The algorithm is based on a dimension reduction technique that allows to apply the Separating Axis Theorem avoiding part of the computation needed to perform the Separating Axis Test. Source code is available online.
منابع مشابه
Fast Ray-Tetrahedron Intersection Using Plucker Coordinates
We present an algorithm for ray–tetrahedron intersection. The algorithm uses Plücker coordinates to represent the ray and the edges of the tetrahedron and employs a robust and efficient test to determine the intersection. The algorithm is highly optimized and provides a significant performance increase over related algorithms.
متن کاملConvex developments of a regular tetrahedron
The best-known developments of a regular tetrahedron are an equilateral triangle and a parallelogram. Are there any other convex developments of a regular tetrahedron? In this paper we will show that there are convex developments of a regular tetrahedron having the following shapes: an equilateral triangle, an isosceles triangle, a right-angled triangle, scalene triangles, rectangles, parallelo...
متن کاملPii: S0010-4485(00)00040-3
Standard representations of irregular finite element meshes combine vertex data (sample coordinates and node values) and connectivity (tetrahedron–vertex incidence). Connectivity specifies how the samples should be interpolated. It may be encoded as four vertex-references for each tetrahedron, which requires 128m bits where m is the number of tetrahedra in the mesh. Our ‘Grow & Fold’ format red...
متن کاملConstruction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations
Three-dimensional Delaunay triangulations are the most common form of three-dimensional triangulations known, but they are not very suitable for tetrahedral nite element meshes because they tend to contain poorly-shaped sliver tetrahedra. In this paper, we present an algorithm for constructing improved-quality triangulations with respect to a tetrahedron shape measure. This algorithm uses combi...
متن کاملAn algorithm to estimate the vertices of a tetrahedron with uniform random points inside
Using n uniform random points inside an arbitrary tetrahedron, we give an algorithm to estimate its vertices. The accuracy of the algorithm is proved by applying a Monte Carlo simulation technique.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Graphics, GPU, & Game Tools
دوره 7 شماره
صفحات -
تاریخ انتشار 2002